A derivative-free bracketing scheme for univariate minimization
نویسندگان
چکیده
منابع مشابه
A Derivative Free Minimization Method For Noisy Functions
An unconstrained minimization method which is based on Powell's derivative free method is presented. The proposed method retains the termination properties of Powell's method and it can be successfully applied to problems with imprecise function values. The ability of this method to cope with imprecise or noisy problems is due to the fact that it proceeds solely by comparing the relative size o...
متن کاملA Derivative-Free Algorithm for Least-Squares Minimization
We develop a framework for a class of derivative-free algorithms for the least-squares minimization problem. These algorithms are designed to take advantage of the problem structure by building polynomial interpolation models for each function in the least-squares minimization. Under suitable conditions, global convergence of the algorithm is established within a trust region framework. Promisi...
متن کاملThe Newton Bracketing Method for Convex Minimization
An iterative method for the minimization of convex functions f : R → R, called a Newton Bracketing (NB) method, is presented. The NB method proceeds by using Newton iterations to improve upper and lower bounds on the minimum value. The NB method is valid for n = 1, and in some cases for n > 1 (sufficient conditions given here). The NB method is applied to large scale Fermat–Weber location probl...
متن کاملNew Sequential and Parallel Derivative-Free Algorithms for Unconstrained Minimization
This paper presents sequential and parallel derivative-free algorithms for finding a local minimum of smooth and nonsmooth functions of practical interest. It is proved that, under mild assumptions, a sufficient decrease condition holds for a nonsmooth function. Based on this property, the algorithms explore a set of search directions and move to a point with a sufficiently lower functional val...
متن کاملBipartite Ranking through Minimization of Univariate Loss
Minimization of the rank loss or, equivalently, maximization of the AUC in bipartite ranking calls for minimizing the number of disagreements between pairs of instances. Since the complexity of this problem is inherently quadratic in the number of training examples, it is tempting to ask how much is actually lost by minimizing a simple univariate loss function, as done by standard classificatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1990
ISSN: 0898-1221
DOI: 10.1016/0898-1221(90)90237-e